Construction of preferences by constraint satisfaction.

نویسندگان

  • Dan Simon
  • Daniel C Krawczyk
  • Keith J Holyoak
چکیده

Participants were given a choice between two multiattribute alternatives (job offers). Preferences for the attributes were measured before, during, and after the choices were made. We found that over the course of decision making, the preferences shifted to cohere with the choice: The attributes of the option that was eventually chosen came to be rated more favorably than they had been rated initially, while the attributes of the rejected option received lower preference ratings than before. These coherence shifts were triggered by a single attribute that decisively favored one option (Experiment 1), and occurred spontaneously in the absence of a decisive attribute (Experiment 2). The coherence shift preceded commitment to choice. These findings favor constraint-satisfaction models of decision making.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositional ecological modelling via dynamic constraint satisfaction with order-of-magnitude preferences

Compositional modelling is one of the most important knowledge-based approaches to automating domain model construction. However, its use has been limited to physical systems due to the specific presumptions made by existing techniques. Based on a critical survey of existing compositional modellers, the strengths and limitations of compositional modelling for its application in the ecological d...

متن کامل

Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences

The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mechanism takes a scenario describing the constituent interacting components of a system and translates it into a useful mathematical model. This paper presents a novel compositional modelling approach aimed at building mod...

متن کامل

Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm

Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which a portion of their preferences are not satisfied, since preferences are regarded in terms of their relative importance. In this paper, we formalize a meeting scheduling as a Distributed Valued Constraint Satisfaction Problem (D...

متن کامل

Constraint Sovling Engine based Nurse rostering with Intelligent Backtracking

Efficient utilization of time and effort is essential in Personnel scheduling problems to evenly balance the workload among the people and attempt to satisfy the personnel preferences. In Constraint Satisfaction Problem based scheduling problems, when a branch of the search fails the backtracking search algorithm back up to the preceding variable and try a different value for it. So here the mo...

متن کامل

asprin: Answer Set Programming with Preferences

Answer Set Programming (ASP) is a well established approach to declarative problem solving, combining a rich yet simple modeling language with high-performance solving capacities. In this talk we present asprin, a general, flexible and extensible framework for preferences in ASP. asprin is general and captures many of the existing approaches to preferences. It is flexible, because it allows for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Psychological science

دوره 15 5  شماره 

صفحات  -

تاریخ انتشار 2004